منابع مشابه
Deterministic Circular Self Test Path
CSTP (Circular Self Test Path) is an attractive technique for testing sequential circuits in the nanometer era because it can easily provide at-speed test. But the area overhead of CSTP is high if random-pattern-resistant faults need to be reliably tested. This paper presents a deterministic CSTP (DCSTP) structure that embeds pre-computed test data with predictable area overhead. Experimental r...
متن کاملEfficient programmable deterministic self-test
In modern times, integrated circuits (ICs) are used in almost all electronic equipment ranging from household appliances to space shuttles and have revolutionized the world of electronics. Continuous reductions in the manufacturing costs as well as the size of this technology have allowed the development of very sophisticated ICs for common use. Post fabrication testing is necessary for each IC...
متن کاملMaking the Circular Self-Test Path Technique Effective for Real Circuits
The paper assesses the effectiveness of the Circular Self-Test Path BIST technique from an experimental point of view and proposes an algorithm to overcome the low fault coverage that often arises when real circuits are examined. Several fault simulation experiments have been performed on the ISCAS89 benchmark set, as well as on a set of industrial circuits: in contrast to the theoretical analy...
متن کاملScalable Deterministic Logic Built-In Self-Test
The core-based design style of integrated circuits (ICs) helps to manage the development challenges brought by the ever increasing complexity of integrated systems and the ever tighter time-to-market. Nevertheless, test-related problems are still far away from having a unitary and satisfactory solution, especially in the system on a chip (SOC) context. For the test of ICs two reference approach...
متن کاملDeterministic Sorting on Circular Arrays
We analyze the sorting problem on circular processor arrays with bidirectional connections. We assume that initially each PU holds k 1 packets. On linear processor arrays the sorting problem can easily be solved for any k by using odd-even transposition sort, but for the circular array it is not obvious how to exploit the wrap-around connection. The easier routing problem on circular processor ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tsinghua Science and Technology
سال: 2007
ISSN: 1007-0214
DOI: 10.1016/s1007-0214(07)70078-0